Bundle Methods for Convex Minimization with Partially Inexact Oracles
نویسنده
چکیده
Recently the proximal bundle method for minimizing a convex function has been extended to an inexact oracle that delivers function and subgradient values of unknown accuracy. We adapt this method to a partially inexact oracle that becomes exact only when an objective target level for a descent step is met. In Lagrangian relaxation, such oracles may save work by evaluating the dual function approximately on most iterations, without compromising the strong convergence properties of exact bundle methods. We also show that the recent method of Gaudioso et al. for finite min–max problems fits our partially inexact framework, we correct and strengthen its convergence results and give useful modifications. Numerical illustrations on standard instances of the generalized assignment problem (GAP) are included.
منابع مشابه
Level bundle methods for constrained convex optimization with various oracles
We propose restricted memory level bundle methods for minimizing constrained convex nonsmooth optimization problems whose objective and constraint functions are known through oracles (black-boxes) that might provide inexact information. Our approach is general and covers many instances of inexact oracles, such as upper, lower and on-demand accuracy oracles. We show that the proposed level bundl...
متن کاملConvex proximal bundle methods in depth: a unified analysis for inexact oracles
The last few years have seen the advent of a new generation of bundle methods, capable to handle inexact oracles, polluted by “noise”. Proving convergence of a bundle method is never simple and coping with inexact oracles substantially increases the technicalities. Besides, several variants exist to deal with noise, each one needing an ad hoc proof to show convergence. We state a synthetic conv...
متن کاملConstrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
Joint chance constrained problems give rise to many algorithmic challenges. Even in the convex case, i.e., when an appropriate transformation of the probabilistic constraint is a convex function, its cutting-plane linearization is just an approximation, produced by an oracle providing subgradient and function values that can only be evaluated inexactly. As a result, the cutting-plane model may ...
متن کاملBundle method for non-convex minimization with inexact subgradients and function values∗
We discuss a bundle method to minimize non-smooth and non-convex locally Lipschitz functions. We analyze situations where only inexact subgradients or function values are available. For suitable classes of non-smooth functions we prove convergence of our algorithm to approximate critical points.
متن کاملInexactness in Bundle Methods for Locally Lipschitz Functions
We consider the problem of computing a critical point of a nonconvex locally Lipschitz function over a convex compact constraint set given an inexact oracle that provides an approximate function value and an approximate subgradient. We assume that the errors in function and subgradient evaluations are merely bounded, and in particular need not vanish in the limit. After some discussion on how t...
متن کامل